Finding Patterns Avoiding Many Monochromatic Constellations

نویسندگان

  • Steve Butler
  • Kevin P. Costello
  • Ronald L. Graham
چکیده

Given fixed 0 = q0 < q1 < q2 < · · · < qk = 1 a constellation in [n] is a scaled translated realization of the qi with all elements in [n], i.e., p, p + q1d, p + q2d, . . . , p + qk−1d, p + d. We consider the problem of minimizing the number of monochromatic constellations in a two coloring of [n]. We show how given a coloring based on a block pattern how to find the number of monochromatic solutions to a lower order term, and also how experimentally we might find an optimal block pattern. We also show for the case k = 2 that there is always a block pattern that beats random coloring.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration Schemes for Words Avoiding Permutations

The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching method is that of enumeration schemes, introduced by Zeilberger and extended by Vatter. In this paper we further extend the method of enumeration schemes to words avoiding permutation patterns. The process of finding enumeration schemes is programmable and allows for the automatic enumer...

متن کامل

Re-clustering of Constellations through Machine Learning

Since thousands of years ago, people around the world have been looking up into the sky, trying to find patterns of visible stars’ distribution, and dividing them into different groups called constellations. Originally, constellations are recognized and organized by people’s imaginations based on the shapes of the star distribution. The most two famous groups of stars is the “Big Dipper” and th...

متن کامل

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

Avoiding Monochromatic Cycles Fabrice Talla Nobibon HEC-Management School, University of Liège, Rue Louvrex 14, Building N1, B-4000 Liège, Belgium, [email protected] Cor A.J. Hurkens Eindhoven University of Technology, Department of Mathematics and Computer Science. P.O. Box 513, 5600 MB Eindhoven, the Netherlands, [email protected] Roel Leus, Frits C.R. Spieksma University of Leuve...

متن کامل

تحلیل ساختار هندسی واگیره ماهی درهم در فرش هراتی

motifs in Iranian carpets is the best-known “Herati” design, also known as “Mahi-dar-ham”, which has been the focus of attention in most weaving centers in decorating carpet fields. The sub-patterns of this design have been slightly modified to add variety to this design. Despite many intricate Islimi (Arabesque) and Khataiee (Tendrils) motis, Mahi-dar-ham is a simple vagire that covers the ove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2010